average path lengthの例文

• It accounts for clustering while retaining the short average path lengths of the ER model.
• Among these chains, the average path length fell around five and a half or six.
• However, the average path length is simply what the path length will most likely be.
• The average path length depends on the system size but does not change drastically with it.
• As the rewiring probability increases, the clustering coefficient decreases slower than the average path length.
• Other properties, such as network diameter, average path length, clustering coefficient vary across models depending on the construction.
• In effect, this allows the average path length of the network to decrease significantly with only slightly decreases in clustering coefficient.
• The global efficiency of network is a measure comparable to 1 / L, rather than just the average path length itself.
• Small world network theory predicts that the average path length changes proportionally to log n, where n is the number of nodes in the network.
• As the Watts Strogatz model begins as non-random lattice structure, it has a very high clustering coefficient along with high average path length.
• An alternative view of the problem is to imagine the population as a social network and attempt to find the average path length between any two nodes.
• The average path length distinguishes an easily negotiable network from one, which is complicated and inefficient, with a shorter average path length being more desirable.
• The average path length distinguishes an easily negotiable network from one, which is complicated and inefficient, with a shorter average path length being more desirable.
• Most real networks have a very short average path length leading to the concept of a small world where everyone is connected to everyone else through a very short path.
• The "'CSDA range "'is a very close approximation to the average path length traveled by a charged particle as it slows down to rest, calculated in the continuous-slowing-down approximation.
• The authors also find that the Wikipedia collaborations can be analyzed using the small-world network approach ( suggesting that the distance between editors, defined as the average path length, with links being articles contributed to, is very small ).
• The estimated true average path length ( that is, the number of edges the email message has to pass from one unique individual to the intended targets in different countries ) for the experiment was around five to seven, which is not much deviated from the original six degree of separation.
• If we construct many random, degree preserving graphs from the real graph, we can then create a probability space for characteristics, such as reciprocity and average path length, and assess the degree to which the network could have expressed these characteristics at random . 534 networks were generated using Degree Preserving Randomization.
• As both reciprocity and average path length in this graph are normally distributed, and as the standard deviation for both reciprocity and average path length are far too narrow to include the observed case, we can reasonably posit that this network is expressing characteristics that are non-random ( and thus open for further theory and modeling ).
• As both reciprocity and average path length in this graph are normally distributed, and as the standard deviation for both reciprocity and average path length are far too narrow to include the observed case, we can reasonably posit that this network is expressing characteristics that are non-random ( and thus open for further theory and modeling ).